278B - New Problem - CodeForces Solution

brute force strings *1500

Please click on ads to support us..

Python Code: 

ch1=""

n=int(input())
a=0
l=[]
li=[]
for i in range (97,123):
    l.append(chr(i))
for i in range (97,123):
    for j in range (97,123):
        l.append(chr(i)+chr(j))
for i in range (n):
    ch=input()
    ch1=ch1+":"+ch
for j in (l):
    if j not in ch1:
            print(j)
            a=1
            break
    if a==1:
        break

C++ Code: 

#include <bits/stdc++.h>
using namespace std;

int main(void) {
  cin.tie(nullptr)->sync_with_stdio(false);

  unordered_set<string> st;
  int n; cin >> n;

  while (n--) {
    string a; cin >> a;
    for (int i = 0; i < a.size(); ++i) {
      string p = "";

      for (int j = i; j < a.size(); ++j) {
        p += a[j];
        st.insert(p);
      }
    }
  }

  queue<string> que;
  
  for (int i = 0; i < 26; ++i) {
    string a = "";
    a += 'a' + i;
    que.push(a);
  }

  while (true) {
    auto p = que.front(); que.pop();

    if (st.find(p) == st.end()) {
      cout << p << "\n";
      return 0;
    }

    for (char c = 'a'; c <= 'z'; ++c) {
      p.push_back(c);
      que.push(p);
      p.pop_back();
    }
  }
}


Comments

Submit
0 Comments
More Questions

620A - Professor GukiZ's Robot
1342A - Road To Zero
1520A - Do Not Be Distracted
352A - Jeff and Digits
1327A - Sum of Odd Integers
1276A - As Simple as One and Two
812C - Sagheer and Nubian Market
272A - Dima and Friends
1352C - K-th Not Divisible by n
545C - Woodcutters
1528B - Kavi on Pairing Duty
339B - Xenia and Ringroad
189A - Cut Ribbon
1182A - Filling Shapes
82A - Double Cola
45A - Codecraft III
1242A - Tile Painting
1663E - Are You Safe
1663D - Is it rated - 3
1311A - Add Odd or Subtract Even
977F - Consecutive Subsequence
939A - Love Triangle
755A - PolandBall and Hypothesis
760B - Frodo and pillows
1006A - Adjacent Replacements
1195C - Basketball Exercise
1206A - Choose Two Numbers
1438B - Valerii Against Everyone
822A - I'm bored with life
9A - Die Roll